Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

We describe a multistage, stochastic, mixed-integer programming model for planning capacity expansion of production facilities. A scenario tree represents uncertainty in the model; a general mixed-integer program defines the operational submodel at each scenario-tree node, and capacity-expansion decisions link the stages. We apply “variable splitting” to two model variants, and solve those vari...

متن کامل

Dantzig-wolfe Decomposition with Gams

This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS.

متن کامل

Dantzig-wolfe Decomposition and Large-scale Constrained Mpc Problems

Model Predictive Control (MPC) strategies are typically implemented in two levels: a steady-state target calculation and a control calculation. The steady-state target calculation consumes excess degrees of freedom within the control problem to provide optimal steady-state performance with respect to some specified objective. In some MPC approaches, the target calculation is formulated as a Lin...

متن کامل

Mechanism Design via Dantzig-Wolfe Decomposition

In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. Lying in the feasible region of the linear program, the fractional point satisfies the underlying constraints. In effect, the point represents a fractional assignment of objects or more generally packages of objects to agents. In order to implement an expected assignment, one must...

متن کامل

A stabilized structured Dantzig-Wolfe decomposition method

We present an algorithmic scheme, which we call the Structured Dantzig-Wolfe decomposition method, that can be used for solving large-scale structured Linear Programs (LPs). The required structure of the LPs is the same as in the original DantzigWolfe approach, that is, a polyhedron over which optimization is “easy” plus a set of “complicating” constraints. Under the hypothesis that an alternat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2009

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.1080.0678